Please consider donating to the Computer Science Club to help offset the costs of bringing you our talks.
Abstract
This talk will describe a non-traditional functional approach to the classical problems of lexing (breaking a stream of characters into "words" or tokens) and parsing (identifying tree structure in a stream of tokens based on a grammar, e.g. for a programming language that needs to be compiled or interpreted). The functional approach can clarify and organize a number of algorithms that tend to be opaque in their conventional imperative presentation. No prior background in functional programming, lexing, or parsing is assumed.
The slides for this talk can be found here as a pdf.
View
Get the Flash Player to see this video using Flash Player.
Download
BitTorrent: XviD | Ogg/Theora | MP4 | MPG
HTTP (web browser): XviD | Ogg/Theora | MP4 | MPG
Contact
If you would like to contact Dr. Ragde check out his website or e-mail him at plragde at uwaterloo dot ca.
Please consider donating to the Computer Science Club to help offset the costs of bringing you our talks.